Finding tight single-change covering designs with v=20, k=5
نویسندگان
چکیده
منابع مشابه
Single-change circular covering designs
A single-change circular covering design (scccd) based on the set [v] = { 1 . . . . . t:} with block size k is an ordered collection o f b blocks, ~ = {Bi . . . . . B/,}, each B~ C [v], which obey: ( 1 ) each block differs from the previous block by a single element, as does the last from the first, and, (2) every pair of [v] is covered by some block. The object is to minimize b for a fixed v a...
متن کاملSingle change neighbor designs
A singl~ change neighbor design SCN(v, k) is a way of selecting a sequence of cycles of length k from a complete graph on v vertices with the properties: any cycle is derived from the preceding one by changing one vertex; and every· edge is covered in at least one cycle. Some properties of these designs are investigated. In particular, designs with the smallest possible number of cycles are con...
متن کاملAsymptotically Optimal Covering Designs
A (v, k, t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering’s size, and the minimum size of such a covering is denoted by C(v, k, t). It is easy to see that a covering must contain at least (v t )
متن کاملRandom Covering Designs
A t (n; k; ) covering design (n k > t 2) consists of a collection of k-element subsets (blocks) of an n-element set X such that each t-element subset of X occurs in at least blocks. Let = 1 and k 2t 1. Consider a randomly selected collection B of blocks; jBj = (n). We use the correlation inequalities of Janson ([10], [1]) to show that B exhibits a rather sharp threshold behaviour, in the sense ...
متن کاملSteiner pentagon covering designs
Let Kn denote the complete undirected graph on n vertices. A Steiner pentagon covering design (SPCD) of order n is a pair (Kn;B), where B is a collection of c(n)= n=5 n−1=2 pentagons from Kn such that any two vertices are joined by a path of length 1 in at least one pentagon of B, and also by a path of length 2 in at least one pentagon of B. The existence of SPCDs is investigated. The main appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00334-4